2005. Pp. viii+532.

نویسنده

  • Andrea Calabrese
چکیده

Unfortunately, most linguists take this equivalence to mean that one should adopt a model which is either rules-only or constraints-only, for the sake of theoretical sanitation. Thus, proponents of Optimality Theory (OT) employ only constraints, while proponents of classical generative phonology (see, for example, Kenstowicz & Kisseberth 1979) employ only rules. At last, someone recognizes that intertranslatability does not mean that a given phonological model must choose between rules and constraints and should have only one or the other. As Andrea Calabrese argues in this book, logical equivalence does not imply equivalent explanatory adequacy for a given phonological phenomenon (34). According to Calabrese, an ideal phonological theory should contain BOTH constraints and rules (119), each serving a different function:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

EATCS Bulletin, Number 87, October 2005, viii+248 pp

S OF PHD THESES . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .  EATCS LEAFLET . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 

متن کامل

EATCS Bulletin, Number 85, February 2005, viii+229 pp

S OF PHD THESES . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .  EATCS LEAFLET . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 

متن کامل

Social and reproductive behaviour in elephants

in A Week with Elephants (eds Daniel, J. C. and Datye, H. S.), Bombay Natural History Society and Oxford University Press, Bombay, 1995, pp. 532. 35. Poole, J. H., Coming of Age with Elephants, Hyperion Press, New York, 1996. 36. Vidya, T. N. C., Fernando, P., Melnick, D. J. and Sukumar, R., Molecular genetic structure and conservation of Asian elephant (Elephas maximus) populations across Indi...

متن کامل

EATCS Bulletin, Number 86, June 2005, viii+273 pp

For over three decades the graph isomorphism problem has tantalized researchers in algorithms and complexity. The study of this problem has stimulated a lot of research and has led to the discovery of important concepts in the area. In this article we take a fresh look at isomorphism problems and highlight some open questions.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007